Random graph asymptotics on high-dimensional tori II. Volume, diameter and mixing time
نویسندگان
چکیده
For critical (bond-) percolation on general high-dimensional torus, this paper answers the following questions: What is the diameter of the largest cluster? What is the mixing time of simple random walk on the largest cluster? The answer is the same as for critical Erdős-Rényi random graphs, and extends earlier results by Nachmias and Peres [35] in this setting. We further improve our bound on the size of the largest cluster in [24], and extend the results on the largest clusters in [9, 10] to any finite number of the largest clusters. Finally, we show that any weak limit of the largest connected component is non-degenerate, which can be viewed as a significant sign of critical behavior. This result further justifies that the critical value defined in [9, 10] is appropriate in our rather general setting of random subgraphs of high-dimensional tori. MSC 2000. 60K35, 82B43.
منابع مشابه
Random graph asymptotics on high-dimensional tori
We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d > 6 for sufficient spread-out percolation. We use a relatively simple coupling argument to show that this largest critical cluster is, with high probability, bounded above by a large constant times V 2/3 and below by a small consta...
متن کاملMixing time of near-critical random graphs
Let C1 be the largest component of the Erdős–Rényi random graph G(n,p). The mixing time of random walk on C1 in the strictly supercritical regime, p = c/n with fixed c > 1, was shown to have order log n by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald. In the critical window, p = (1 + ε)/n where λ= εn is bounded, Nachmias and Peres proved that the mixing time on C1 is...
متن کاملGetting Lost Efficiently
We consider the mixing time of random walks on a graph G, using the eigenvalue gap to measure the mixing time. We attempt to bound the mixing time in terms of the diameter Diam of G. We show that, for the standard random walk, there exists a family of graphs with diameter 3 but mixing time Ω(n), and a family of trees with diameter 3 but mixing time Ω(n). The main result is a scheme for re-weigh...
متن کاملCycle structure of percolation on high-dimensional tori
In the past years, many properties of the critical behavior of the largest connected components on the high-dimensional torus, such as their sizes and diameter, have been established. The order of magnitude of these quantities equals the one for percolation on the complete graph or Erdős-Rényi random graph, raising the question whether the scaling limits or the largest connected components, as ...
متن کاملAnatomy of a young giant component in the random graph
We provide a complete description of the giant component of the Erdős-Rényi random graph G(n, p) as soon as it emerges from the scaling window, i.e., for p = (1 + ε)/n where εn → ∞ and ε = o(1). Our description is particularly simple for ε = o(n), where the giant component C1 is contiguous with the following model (i.e., every graph property that holds with high probability for this model also ...
متن کامل